#include"B_tree.h"

int main()
{
	BN* node1=  BuyNode(4);
	BN* node2 = BuyNode(5);
	BN* node3 = BuyNode(1);
	BN* node4 = BuyNode(2);
	BN* node5 = BuyNode(3);
	BN* node6 = BuyNode(6);

	node1->LeftNode = node2;
	node1->RightNode = node3;
	node2->LeftNode = node4;
	node2->RightNode = node5;
	node3->LeftNode = node6;

	/*printf("%d\n",AllNode(node1));
	printf("%d\n", AllLeafNode(node1));
	printf("%d\n", KAllNode(node1,3));*/

	PreOrder(node1);
	printf("\n");
	InOrder(node1);
	printf("\n");
	PostOrder(node1);


}